Natural Deduction for First-Order Hybrid Logic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Natural Deduction for First-Order Hybrid Logic

This is a companion paper to [6] where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geom...

متن کامل

Natural Deduction for Hybrid Logic

In this paper we give a natural deduction formulation of hybrid logic. Our natural deduction system can be extended with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of hybrid logics which appears to be impossible in the context of ordinar...

متن کامل

Novel Didactic Proof Assistant for First-Order Logic Natural Deduction

We present a proof assistant designed to help learning formal proof, particularly in the system of Natural Deduction for First-Order Logic. The assistant handles formulas and derivations containing metavariables and allows to maintain a library of instanciable lemmas. It possesses a graphical interface presenting proofs as trees and handles multiple simultaneous derivations that can be dragged ...

متن کامل

Automated First Order Natural Deduction

We present a proof-searching algorithm for the classical first order natural deduction calculus and prove its correctness. For any given task (if this task is indeed solvable), a searching algorithm terminates, either finding a corresponding natural deduction proof or giving a set of constraints, from which a counter-example can be extracted. Proofs of the properties which characterize correctn...

متن کامل

On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem

We present a new Curry-Howard correspondence for classical first-order natural deduction. We add to the lambda calculus an operator which represents, from the viewpoint of programming, a mechanism for raising and catching multiple exceptions, and from the viewpoint of logic, the excluded middle over arbitrary prenex formulas. The machinery will allow to extend the idea of learning – originally ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logic, Language and Information

سال: 2005

ISSN: 0925-8531,1572-9583

DOI: 10.1007/s10849-005-3927-y